Studying Sequent Systems via Non-deterministic Multiple-Valued Matrices

نویسنده

  • Ori Lahav
چکیده

We consider a family of sequent systems with “well-behaved” logical rules in which the cut rule and/or the identity-axiom are not present. We provide a semantic characterization of the logics induced by these systems in the form of non-deterministic three-valued or four-valued matrices. The semantics is used to study some important proof-theoretic properties of these systems. These results shed light on the dual semantic roles of the cut rule and the identity-axiom, showing that they are both crucial for having deterministic finite-valued semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cut-free sequent calculi for C-systems with generalized finite-valued semantics

In [5], a general method was developed for generating cut-free ordinary sequent calculi for logics that can be characterized by finite-valued semantics based on non-deterministic matrices (Nmatrices). In this paper, a substantial step towards automation of paraconsistent reasoning is made by applying that method to a certain crucial family of thousands of paraconsistent logics, all belonging to...

متن کامل

Systems for Reasoning about Computation Errors

In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without distinguishing between...

متن کامل

Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics

Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency , and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...

متن کامل

Kripke-Style Semantics for Normal Systems

In this paper we describe a generalized framework of sequent calculi, called normal systems, which is suitable for a wide family of propositional logics. This family includes classical logic, several modal logics, intuitionistic logic, its dual, bi-intuitionistic logic, and various finite-valued logics. We present a general method for providing a non-deterministic finite-valued Kripke-style sem...

متن کامل

Effective Non-deterministic Semantics for First-order LFIs

A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, which has led to the family of Logics of Formal Inconsistency (LFIs), where the notion of inconsistency is expressed at the object level. In this paper we use non-deterministic matrices, a generalization of standard ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Multiple-Valued Logic and Soft Computing

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2013